record dproven probabilist databas effici slca comput servic xml filter iaa open user schema guid evalu stream rdf queri bipartit graph data manag identifi commun structur network seed expans dclose kl ddiverg semant privaci distribut slca dbase xml keyword search map dreduc fvc featur dvector dbase classif xml dissemin gram effici framework xml structur similar search automat filter algorithm imbalanc classif learn rank train data relat domain xml structur similar search mapreduc semi dsupervis learn posit unlabel data entropi data mine approach xml dissemin mine dredund divers pattern inform theoret perspect financi inform process develop emerg financi market financi inform process develop emerg financi market manag replac web servic underli semant effici cluster probabilist data stream detect abnorm trend evolut multipl data stream improv algorithm mine dredund interact featur subset directli identifi unexpect instanc test set entropi maxim mine entropi ddivers pattern hash dsearch effici slca dbase keyword search algorithm xml document truster trajectori data process cluster data access method distribut massiv comput effici indic graph partit rdf tripl store track high qualiti cluster uncertain data stream knowledg discoveri academ search engin optim workload dawar xml relat schema map multi ddimension data densiti estim network discov semant associ web servic base qualit probabilist network financi inform process paper model firm choic altern mean present inform ect di erent present market price investor limit attent process power market equilibrium partial attent investor examin ect altern level discret pro forma earn disclosur method account employe option compens degre aggreg report effici peer dto dpeer index tree structur multidimension data distribut approach enabl privaci dpreserv model dbase classifi train detect overlap commun structur network featur select base depend measur detect overlap commun structur network global partit local expans featur select base depend measur costa adapt index term larg dscale distribut system smart system onlin monitor larg volum network traffic continu content dbase copi detect stream video fast method find solut servic composit disg distribut graph repositori web infrastructur invit paper person new video recommend interact explor knowledg mine visual new webpag larg dscale new video databas simp effici xml structur index multipl queri process effici queri rdf data tripl store introduct special section peer dto dpeer comput web data manag wide tabl manag web data survei track cluster evolv data stream slide window track cluster evolv data stream slide window divid apu float point unit compris execut unit regist file bu interfac control logic manag execut float point instruct figur overview float point unit fpu architectur proceed acm sigmod intern confer manag data linp support similar search unstructur peer dto dpeer network gchord index multi dattribut queri system low mainten cost abstract provid complex queri process peer peer system attract attent academ industri commun present gchord scalabl techniqu evalu queri multi attribut exact match rang queri handl gchord advantag exist method tupl index queri effici guarante index mainten cost search effici balanc addit optim techniqu improv perform gchord extens experi conduct valid effici propos method ab dindex effici adapt index branch xml queri sdi swift tree structur multi ddimension data index peer dto dpeer network effici multi dimension data search receiv attent central system implement larg scale distribut system trivial job remain challeng paper sdi succinct multi dimension balanc tree structur base peer peer technolog present sdi structur queri effici bound log compar previou tree base method sdi extrem low mainten cost due carefulli chosen finger link algorithm design point queri rang queri process make sdi free root bottleneck problem experiment result valid effici effect propos approach effici servic data manag dynam environ sdi swift tree structur multi ddimension data index peer dto dpeer network effici multi dimension data search receiv attent central system implement larg scale distribut system trivial job remain challeng paper sdi succinct multi dimension balanc tree structur base peer peer technolog present sdi structur queri effici bound log compar previou tree base method sdi extrem low mainten cost due carefulli chosen finger link algorithm design point queri rang queri process make sdi free root bottleneck problem experiment result valid effici effect propos approach mqx multi dqueri engin compress xml data sonnet effici distribut content dbase dissemin broker academ web search engin gener survei automat sonnet subscript path queri structur overlai network adapt schedul share window join data stream vslattic vector dbase conceptu index structur web servic retriev adapt dynam dimension reduct method high ddimension index approxim top dk structur similar search xml document effici evalu distanc predic xpath full dtext queri effici doper framework multi dqueri process compress xml data abstract xml de facto standard exchang present inform web xml data recogn verbos heavili inflat size data due repeat tag structur data verbos problem rise challeng convent distribut databas technolog paper studi xml dissemin problem internet speed inform deliveri slow server client architectur consist larg number geograph span user access larg amount correl xml inform problem sever user access close relat xml fragment case usag bandwidth ineffici order save bandwidth process queri effici propos architectur incorpor xml compress techniqu exploit result xpath contain framework demonstr load server reduc network bandwidth effici client benefit due save cost pmjoin optim distribut multi dwai stream join stream partit abstract emerg data stream applic data sourc typic distribut evalu multi join queri stream sourc incur larg commun cost queri run continu preciou bandwidth aggress consum care optim oper order placement paper focu optim continu multi join queri distribut stream observ partit stream substream significantli reduc commun cost propos partitionbas join scheme pmjoin partit techniqu studi gener queri plan substream heurist algorithm propos base rate base model result extens experiment studi show techniqu suffici reduc commun cost keynot keyword search node select text retriev dht dbase network sipper select inform peer structur environ content dbase retriev vbi dtree peer dto dpeer framework support multi ddimension index scheme multi dimension data index receiv attent central databas work topic context peerto peer system paper propos peer peer framework base balanc tree structur overlai support extens central map method queri process base varieti multidimension tree structur includ tree tree ss tree tree specif network node framework guarante point queri rang queri answer logn hop provid effect load balanc strategi node balanc work load effici experiment assess valid practic propos approxim process multi dgranular aggreg queri data stream densiti dbase cluster evolv data stream nois cluster import task mine evolv data stream limit memori pass constraint natur evolv data stream impli requir stream cluster assumpt number cluster discoveri cluster arbitrari shape abil handl outlier lot cluster algorithm data stream propos offer solut combin requir paper present denstream approach discov cluster evolv data stream dens micro cluster name core micro cluster introduc summar cluster arbitrari shape potenti core micro cluster outlier micro cluster structur propos maintain distinguish potenti cluster outlier prune strategi design base concept guarante precis weight micro cluster limit memori perform studi number real synthet data set demonstr effect effici method scalabl cluster graphic processor shanghaigrid inform servic grid index fast move object knn queri base nearest landmark fals neg approach mine frequent itemset high speed transact data stream effici comput dmedian data stream memori constraint qo dawar composit servic retriev find centric local outlier categor fnumer space adapt probabilist search unstructur peer dto dpeer comput system shanghaigrid grid prototyp metropoli inform servic distinct estim set express slide window framework web servic composit distribut xml queri evalu model web servic base bayesian network optim continu multijoin queri distribut stream manag retriev web servic base formal concept analysi effici rank queri process peer dto dpeer network dters peer dto dpeer base text retriev search system concept dbase retriev altern web servic wsqueri xqueri web servic integr fals dneg frequent item mine data stream burst adapt detect aggreg burst data stream abstract find burst data stream attract attent research commun due broad applic exist burst detect method suffer problem paramet window size absolut burst threshold hard determin priori advanc side burst increas decreas burst detect bump aggreg data caus nois report burst disturb bump effort subsequ explor mine result paper gener burst model introduc overcom problem develop effici algorithm detect adapt aggreg burst data stream burst ratio invert histogram statist summari compress fit limit main memori burst window length detect accur effici line theoret analysi show space time complex bound method good experiment result depict applic effici algorithm applic set cocach queri process base collabor cach system shanghaigrid inform servic grid overview support rank join peer dto dpeer network effici web servic composit base syntact match bloom filter dbase xml packet filter million path queri filter xml data basi complex applic lot algorithm propos shanghaigrid inform servic grid overview support multi ddimension rang queri peer dto dpeer system rang queri multi dimension data extend exist system support multidimension rang queri issu space partit map effici queri process load balanc paper describ scheme call znet address issu conduct extens perform studi evalu znet recent propos result show znet possess desir properti typic fail filter duplic item distribut data stream make differ benchmark xml databas implement overview present kei design program languag technic concept exampl give reader feel languag gener purpos program languag bia system program support effici low level comput data abstract object orient program gener program introduct overview program languag model memori comput close match comput addit power flexibl mechan abstract languag construct programm introduc type object match concept applic support style program reli fairli direct manipul hardwar resourc deliv high degre effici higher level style program reli user defin type provid model data comput closer huma proceed aci intern confer softwar engin scalabl xslt evalu effici queri rout xml document retriev unstructur peer dto dpeer network adapt probabilist search unstructur system distribut rank strategi peer dto dpeer base inform retriev system peersdi peer dto dpeer inform dissemin system load balanc peer dto dpeer environ web servic dshoq nonmonoton extens descript logic shoq adapt content nativ space load balanc index abstract todai increas demand share data complex data type multi dimension larg number data sourc kei challeng share data scalabl effici paper present design znet network support multi dimension data znet directli oper nativ data space partit dynam map node network attent reduc load imbal node due skew data distribut result extens simul studi show znet effici rout process rang queri good load balanc dmail servic hybrid network servic select dynam demand ddriven web servic fals posit fals neg mine frequent itemset high speed transact data stream tro model implement xml data manag capac plan composit web servic queue network dbase model sequenti classifi combin text categor experiment studi mine frequent item spatio dtempor databas cc dbuddi adapt framework maintain cach coher peer paper propos framework call cc buddi maintain dynam data coher peer peer environ work basi peer heterogen data coher requir peer cc buddi cooper dissemin updat push simul result show solut improv fidel data reduc workload server achiev high scalabl scalabl xslt evalu deriv relat kei xml kei work xml data storag queri constraint xml kei constraint propos paper xml research work constraint paper import class constraint xml kei find relationship xml kei relat kei xml data semant repres xml kei simpl transform languag express transform xml data relat databas provid formal definit relat tree repres form rule relat written transform languag rule make transform written show xml data transform relat final present algorithm deriv relat kei xml kei kei transform relat compat predefin schema verifi inform acquisit integr paradigm agent peer dto dpeer fuzzi cost model peer dto dpeer system abstract object queri optim select good execut plan queri distribut system crucial queri optim effect remot cost estim order make satisfactori decis categori cost estim model static cost model dynam cost model model suffer limit static cost model capabl reflect real time situat dynam cost model scalabl due extens probe queri model design ad hoc system dynam peer consider paper firstli propos progress push base remot cost monitor approach deriv gener static cost model convent static approach agent remot host gener cost model epsilon indic magnitud cost chang percentag coeffici chang updat push origin host magnitud cost chang exce introduc fuzzi cost evalu metric addit tradit evalu criteria handl dynam system metric confid measur peer reliabl contribut successfulli address issu cost model environ dynam peer effici evalu xml xml transform fixt flexibl index xml transform constraint preserv xml updat explor small world phenomena pure inform share system instrument physic world larg network wireless sensor node applic environment monitor water soil requir node small light unteth unobtrus problem local determin node physic locat network challeng extrem crucial applic practic consider small size form factor cost power constraint node preclud relianc gp global posit system node network paper review local techniqu evalu effect simpl connect metric method local outdoor environ make inher radio frequenc rf commun capabl devic fix number refer point network overlap region coverag transmit period beacon signal node dynam maintain frequent item data stream challeng maintain frequent item data stream small bound memori dynam environ insert delet item allow paper propos algorithm call hcount handl insert delet item memori space report algorithm algorithm superior term precis recal process time addit approach request preknowledg size rang data stream handl rang extens dynam modif algorithm hcount improv hcount own significantli perform fast text classif train dcorpu prune base approac dkernel merg densiti estim data stream densiti estim costli oper comput distribut inform data set underli import data mine applic cluster bias sampl tradit densiti estim method inapplic stream data continu arriv larg volum data request linear storag squar size calcul shortcom limit applic exist effect algorithm data stream mine problem emerg applic challeng research paper problem comput densiti function data stream examin method attack shortcom exist method develop enabl densiti estim larg volum data linear time fix size memori lose accuraci method base kernel merg limit kernel function maintain determin intellig applic method stream data model discuss result intens experi present analyt empir result show densiti estim algorithm data stream calcul densiti function demand time high accuraci stream data model index select effici xml path express process peerbu middlewar framework interoper data share system overlai network base chord shanghaigrid action stage project digit citi citi grid dynam tune xml storag schema vxmlr peerdb dbase system distribut data share paper present design evalu peerdb peer peer distribut data share system peerdb distinguish exist system wai full fledg data manag system support fine grain content base search facilit share data share schema combin power mobil agent system perform oper peer site fourth peerdb network configur node dynam optim set peer commun directli base optim criterion keep peer provid inform servic close proxim direct commun network bandwidth util system perform optim implement evalu peerdb cluster pentium ii pc experiment result show peerdb effect exploit technolog distribut data share make differ benchmark xml databas implement adapt effici dimension reduct algorithm high ddimension index notori dimension curs phenomenon multi dimension index attempt scale high dimens approach overcom degrad perform respect increas dimens reduc dimension origin dataset construct index identifi correl dimens effect reduc challeng task paper present adapt multi level mahalanobisbas dimension reduct mmdr techniqu high dimension index mmdr techniqu notabl featur compar exist method discov ellipt cluster low dimension subspac data point axi system index singl tree techniqu highli scalabl term data size dimension extens perform studi real synthet dataset conduct result show techniqu achiev higher precis enabl queri process effici dynam tune xml storag schema vxmlr hot hypergraph dbase outlier test categor data wide data mine techniqu outlier detect process aim find anomali good explan exist method design numer data meet problem real life applic categor data peerdb peer person databas trex dtd dconform xml xml transform effici semant search peer dto dpeer system peer dserv framework web servic peer dto dpeer environ dynam cluster dbase queri answer peer dto dpeer system comput emploi applic domain technolog matur popular success applic area file share current file share system support keybas exact match chord keyword base search napster gnutella file discoveri locat meet requir advanc applic inform retriev data manag paper propos queri answer model applic term cluster base queri answer cbqa definit cbqa retriev data object cluster queri global dataset distribut peer system gener cbqa obtain correct answer similar base queri mean higher recal achiev implement queri model present framework support cluster base queri answer includ gener algorithm lemma system architectur give concret algorithm cluster criteria nearest neighbor distancebas densiti base cluster detail analys discuss final implement issu dynam neighbor select cach techniqu enabl scalabl method address theoret analysi preliminari experi show method guarante find desir object interest cluster modest bandwidth overhead ud dindex effici approxim index xml data cluster larg databas base distanc densiti data manag peer dto dpeer environ perspect bestpeer dvq visual queri process xml databas system buddyweb dbase collabor web cach system paper applic collabor web cach unlik exist web cach techniqu typic manag proxi exploit local cach node pc enterpris network dvq dtd ddriven visual queri interfac xml databas system dtd ddirect publish attribut translat grammar present framework publish relat data xml respect fix dtd data exchang web xml view relat data typic requir conform predefin dtd presenc recurs dtd determin make challeng gener dtd direct effici transform empir studi learn dbase web search approach facilit inform search web current web search queri system return url relev page learn base web search invent target process url dig desir inform util user feedback structur map index effici xml path express process topic explor distil web search similar dbase analysi content dbase resourc locat mechan peeri flurri research comput technic challeng emerg effici locat desir resourc advanc made hot research field pioneer pastri chord tapestri function distribut hash tabl achiev fair effect common limit ignor autonom natur peer support weakli semant function paper realiti distribut network propos content base locat mechan autonomi peer support approxim queri finer granular content share mechan facilit system evolv dynam peeri base inform system verifi obtain satisfactori result yn dgram dbase approach detect approxim duplic databas record similar dbase model topic distil classif method overcom effect discoveri except class associ rule cluster dtd interact dlevel approach mobil dagent base distribut web gi hybrid approach cluster larg databas vxmlr visual xml drelat databas system enhanc xml data process relat system indic adjac matrix base full dtext index model web dage inform manag mobil agent dbase distribut geograph inform system internet environ combin sampl techniqu dbscan algorithm cluster larg spatial databas implement proof normal design object dorient data scheme increment mine schema semistructur data fast algorithm mine probabl function depend rule relat databas gener multidimension associ rule wide applic comput autom data collect tool massiv amount data continu collect store databas creat immin great opportun mine interest knowledg data associ rule mine kind data mine techniqu discov strong associ correl relationship data discov rule market basket cross sale analysi decis make busi manag thesi propos develop interest associ rule mine approach call line analyt mine associ rule integr recent develop olap line analyt process technolog effici associ mine method lead flexibl multi dimension multi level associ rule mine high perform algorithm develop base approach mine kind associ multi dimension approach scale dbscan algorithm larg spatial databas improv definit multidimension inter dtransact associ rule increment mine schema semistructur data mine function depend rule relat databas 